ADPfusion Efficient Dynamic Programming over Sequence Data Christian H¨oner zu Siederdissen ∗

Source URL: www.bioinf.uni-leipzig.de

Linked Lists in Snap! Jens Mönig MarLists in Snap are internally hybrid data structures; they can be used either as mutable dynamic arrays or as immutable linked lists. In a linked list each node only stores i

Source URL: snap.berkeley.edu

THREDDS Explorer Access and visualization of Meteo-Oceanographic dynamic data with QGIS Harold Hormaechea Mauri Benedito-Bordonau

Source URL: www.sigte.udg.edu

• Computing
• Data
• Computer file formats
• Technical communication
• OPeNDAP
• QGIS
• Web browser
• Web Coverage Service

System Administration Certification exam 918 for IBM Informix Dynamic Server 11 prep, Part 8: SQL features for administrators Skill Level: Intermediate Michaela Trautwein-Ostner () Advanced Support Eng

Source URL: www.iiug.org

• Data management
• Software
• SQL keywords
• Computing
• Relational database management systems
• Null
• Select
• SQL
• Is functions

IBM Information Management IBM Informix® 12.10 Enhancements in Storage Space Management A Technical White Paper

Source URL: www.iiug.org

• Software
• Data management
• Relational database management systems
• IBM Informix
• Database management systems
• Disk partitioning
• Select
• File system
• Hierarchical and recursive queries in SQL
• Informix Corporation
• IBM Informix Dynamic Server

Tenke-Fungurume Dynamic unfolding-complex geology case study of Tenke-Fungurume deposits by Justin Cardwell and Alyson Cartwright

Source URL: www.hexagonmining.com

• Geostatistics
• Interpolation
• MAC service data unit
• Media access control
• Kriging
• Lak language
• Freeport-McMoRan
• Culture
• Data

On the Revival of Dynamic Languages Oscar Nierstrasz, Alexandre Bergel, Marcus Denker, St´ephane Ducasse, Markus G¨ alli, and Roel Wuyts Software Composition Group, University of Bern www.iam.unibe.ch/∼scg

Source URL: rmod.inria.fr

• Software engineering
• Computer programming
• Computing
• Object-oriented programming languages
• Object-oriented programming
• Data types
• Type theory
• Programming paradigms
• Smalltalk
• Type system
• Objective-C
• R

Hybrid Dynamic Data Race Detection Robert O’Callahan Jong-Deok Choi IBM T. J. Watson Research Center

Source URL: www.cs.columbia.edu

• Computing
• Computer programming
• Concurrency control
• Software engineering
• Software design patterns
• Concurrency
• Edsger W. Dijkstra
• Concurrent computing
• Synchronization
• Thread-local storage
• Java memory model
• Thread

Title:   Stratigraphic  Evidence  for  Stepwise  Migration  of  Dynamic  Subsidence  During  Subduction:  Review  and   New  Data  from  the  Fox  Hills  Sandstone

Source URL: gsa.seg.org

• Geology
• Sedimentology
• Stratigraphy
• Structural geology
• Progradation
• Structural basin
• Sedimentary rock

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

Source URL: bioinfo.ict.ac.cn

• Mathematics
• Statistics
• Applied mathematics
• Data mining
• Search algorithms
• Approximation algorithms
• Discrete geometry
• Nearest neighbor search
• Numerical analysis
• Hierarchical clustering
• Cluster analysis
• K-means clustering